Tailored graph ensembles as proxies or null models for real networks II: results on directed graphs
نویسندگان
چکیده
† Department of Mathematics, King’s College London, The Strand, London WC2R 2LS, United Kingdom ‡ Randall Division of Cell and Molecular Biophysics, King’s College London, New Hunts House, London SE1 1UL, United Kingdom § London Institute for Mathematical Sciences, 35a South St, Mayfair, London W1K 2XF, United Kingdom ⋆ Department of Medical and Molecular Genetics, King’s College London School of Medicine, 8th floor Guy’s Tower, London SE1 9RT, United Kingdom
منابع مشابه
Tailored graph ensembles as proxies or null models for real networks
We study the tailoring of structured random graph ensembles to real networks, with the objective of generating precise and practical mathematical tools for quantifying and comparing network topologies macroscopically, beyond the level of degree statistics. Our family of ensembles can produce graphs with any prescribed degree distribution and any degree–degree correlation function; its control p...
متن کاملTailored graph ensembles as proxies or null models for real networks I: tools for quantifying structure.
We study the tailoring of structured random graph ensembles to real networks, with the objective of generating precise and practical mathematical tools for quantifying and comparing network topologies macroscopically, beyond the level of degree statistics. Our family of ensembles can produce graphs with any prescribed degree distribution and any degree-degree correlation function, its control p...
متن کاملRandom Graph Ensembles with Many Short Loops
Networks observed in the real world often have many short loops. This violates the treelike assumption that underpins the majority of random graph models and most of the methods used for their analysis. In this paper we sketch possible research routes to be explored in order to make progress on networks with many short loops, involving old and new random graph models and ideas for novel mathema...
متن کاملExploring the randomness of Directed Acyclic Networks
The feed-forward relationship naturally observed in time-dependent processes and in a diverse number of real systems-such as some food webs and electronic and neural wiring-can be described in terms of the so-called directed acyclic graphs (DAGs). An important ingredient of the analysis of such networks is a proper comparison of their observed architecture against an ensemble of randomized grap...
متن کاملThe entropy of randomized network ensembles
Abstract. Randomized network ensembles are the null models of real networks and are extensivelly used to compare a real system to a null hypothesis. In this paper we study network ensembles with the same degree distribution, the same degree-correlations or the same community structure of any given real network. We characterize these randomized network ensembles by their entropy, i.e. the normal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1101.6022 شماره
صفحات -
تاریخ انتشار 2011